0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.12/0.35	% Computer : n014.cluster.edu
0.12/0.35	% Model    : x86_64 x86_64
0.12/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.35	% Memory   : 8042.1875MB
0.12/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.35	% CPULimit   : 1440
0.12/0.35	% WCLimit    : 180
0.12/0.35	% DateTime   : Thu Jul  4 06:00:09 EDT 2024
0.12/0.35	% CPUTime    : 
0.22/0.50	Running higher-order theorem proving
0.22/0.51	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.0xplmvHbeL/E---3.1_28869.p
2.14/0.82	# Version: 3.2.0-ho
2.14/0.82	# Preprocessing class: HSSSSMSSSSSNSSA.
2.14/0.82	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
2.14/0.82	# Starting post_as_ho12 with 180s (1) cores
2.14/0.82	# Starting new_bool_9 with 180s (1) cores
2.14/0.82	# Starting post_as_ho1 with 180s (1) cores
2.14/0.82	# Starting post_as_ho4 with 180s (1) cores
2.14/0.82	# Starting post_as_ho2 with 180s (1) cores
2.14/0.82	# Starting ehoh_best2_full_lfho with 180s (1) cores
2.14/0.82	# Starting full_lambda_10 with 180s (1) cores
2.14/0.82	# Starting new_ho_8 with 180s (1) cores
2.14/0.82	# post_as_ho2 with pid 28983 completed with status 0
2.14/0.82	# Result found by post_as_ho2
2.14/0.82	# Preprocessing class: HSSSSMSSSSSNSSA.
2.14/0.82	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
2.14/0.82	# Starting post_as_ho12 with 180s (1) cores
2.14/0.82	# Starting new_bool_9 with 180s (1) cores
2.14/0.82	# Starting post_as_ho1 with 180s (1) cores
2.14/0.82	# Starting post_as_ho4 with 180s (1) cores
2.14/0.82	# Starting post_as_ho2 with 180s (1) cores
2.14/0.82	# No SInE strategy applied
2.14/0.82	# Search class: HGUNF-FFMF22-SSSFFMBN
2.14/0.82	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
2.14/0.82	# Starting ehoh_best2_full_lfho with 98s (1) cores
2.14/0.82	# ehoh_best2_full_lfho with pid 28995 completed with status 0
2.14/0.82	# Result found by ehoh_best2_full_lfho
2.14/0.82	# Preprocessing class: HSSSSMSSSSSNSSA.
2.14/0.82	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
2.14/0.82	# Starting post_as_ho12 with 180s (1) cores
2.14/0.82	# Starting new_bool_9 with 180s (1) cores
2.14/0.82	# Starting post_as_ho1 with 180s (1) cores
2.14/0.82	# Starting post_as_ho4 with 180s (1) cores
2.14/0.82	# Starting post_as_ho2 with 180s (1) cores
2.14/0.82	# No SInE strategy applied
2.14/0.82	# Search class: HGUNF-FFMF22-SSSFFMBN
2.14/0.82	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
2.14/0.82	# Starting ehoh_best2_full_lfho with 98s (1) cores
2.14/0.82	# Preprocessing time       : 0.001 s
2.14/0.82	
2.14/0.82	# Proof found!
2.14/0.82	# SZS status Theorem
2.14/0.82	# SZS output start CNFRefutation
2.14/0.82	thf(decl_22, type, esk1_0: $i).
2.14/0.82	thf(decl_23, type, esk2_0: $i).
2.14/0.82	thf(decl_24, type, esk3_0: $i).
2.14/0.82	thf(decl_25, type, epred1_0: $i > $o).
2.14/0.82	thf(decl_26, type, esk4_2: ($i > $o) > ($i > $o) > $i).
2.14/0.82	thf(cTHM125C, conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i > $o]:(?[X5:$i > $o, X6:$i > $o]:((((((X5 @ X1)|(X6 @ X1))&((X4 @ X2)|(X6 @ X2)))&((X5 @ X3)|~((X4 @ X3))))&![X7:$i]:(((X6 @ X7)<=>~((X4 @ X7))))))), file('/export/starexec/sandbox/tmp/tmp.0xplmvHbeL/E---3.1_28869.p', cTHM125C)).
2.14/0.82	thf(c_0_1, negated_conjecture, ~(![X1:$i, X2:$i, X3:$i, X4:$i > $o]:(?[X5:$i > $o, X6:$i > $o]:((((((X5 @ X1)|(X6 @ X1))&((X4 @ X2)|(X6 @ X2)))&((X5 @ X3)|~((X4 @ X3))))&![X7:$i]:(((X6 @ X7)<=>~((X4 @ X7)))))))), inference(assume_negation,[status(cth)],[cTHM125C])).
2.14/0.82	thf(c_0_2, negated_conjecture, ![X19:$i > $o, X20:$i > $o]:((((((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0)))))&((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X19 @ esk1_0))))))&(((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(X20 @ esk2_0)|~(X19 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(X20 @ esk2_0)|~(X19 @ esk1_0)))))&((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(X20 @ esk2_0)|~(X19 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(X20 @ esk2_0)|~(X19 @ esk1_0)))))))&((((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0)))))&((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(epred1_0 @ esk2_0)|~(X20 @ esk1_0))))))&(((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(X20 @ esk2_0)|~(X20 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|(~(X19 @ esk3_0)|(~(X20 @ esk2_0)|~(X20 @ esk1_0)))))&((~(X20 @ (esk4_2 @ X19 @ X20))|(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(X20 @ esk2_0)|~(X20 @ esk1_0))))&((X20 @ (esk4_2 @ X19 @ X20))|~(epred1_0 @ (esk4_2 @ X19 @ X20))|((epred1_0 @ esk3_0)|(~(X20 @ esk2_0)|~(X20 @ esk1_0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
2.14/0.82	thf(c_0_3, negated_conjecture, ![X4:$i > $o, X5:$i > $o]:(((epred1_0 @ (esk4_2 @ X5 @ X4))|~((X4 @ (esk4_2 @ X5 @ X4)))|~((X5 @ esk3_0))|~((X4 @ esk2_0))|~((X5 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.14/0.82	thf(c_0_4, negated_conjecture, ![X4:$i > $o, X5:$i > $o]:(((X4 @ (esk4_2 @ X5 @ X4))|~((epred1_0 @ (esk4_2 @ X5 @ X4)))|~((X5 @ esk3_0))|~((X4 @ esk2_0))|~((X5 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.14/0.82	thf(c_0_5, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ esk2_0)|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])).
2.14/0.82	thf(c_0_6, negated_conjecture, ![X4:$i > $o, X5:$i > $o]:(((X4 @ (esk4_2 @ X5 @ X4))|~((epred1_0 @ (esk4_2 @ X5 @ X4)))|~((X5 @ esk3_0))|~((epred1_0 @ esk2_0))|~((X5 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.14/0.82	thf(c_0_7, negated_conjecture, ![X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4)))|~((X4 @ esk2_0)))), inference(primitive_enumeration,[status(thm)],[c_0_4])).
2.14/0.82	thf(c_0_8, negated_conjecture, ![X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((epred1_0 @ Z0))))))|(epred1_0 @ esk2_0)|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(ef,[status(thm)],[c_0_5])).
2.14/0.82	thf(c_0_9, negated_conjecture, ![X4:$i > $o, X5:$i > $o]:(((epred1_0 @ (esk4_2 @ X5 @ X4))|~((X4 @ (esk4_2 @ X5 @ X4)))|~((X5 @ esk3_0))|~((epred1_0 @ esk2_0))|~((X5 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.14/0.82	thf(c_0_10, negated_conjecture, ![X28:$i > $i, X27:$i > $i, X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4))|((X27 @ esk1_0)!=(X28 @ esk1_0))|((X27 @ esk3_0)!=(X28 @ esk3_0))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4)))|~((epred1_0 @ esk2_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_6])).
2.14/0.82	thf(c_0_11, negated_conjecture, (epred1_0 @ esk2_0), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8])])])).
2.14/0.82	thf(c_0_12, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|~((epred1_0 @ esk2_0))|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_9])).
2.14/0.82	thf(c_0_13, negated_conjecture, ![X28:$i > $i, X27:$i > $i, X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4))|((X27 @ esk1_0)!=(X28 @ esk1_0))|((X27 @ esk3_0)!=(X28 @ esk3_0))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(((X27 @ Z0)=(X28 @ Z0)))) @ X4))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])).
2.14/0.82	thf(c_0_14, negated_conjecture, ![X5:$i > $o, X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|(X5 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((X5 @ Z0))))))|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_11])])).
2.14/0.82	thf(c_0_15, negated_conjecture, ![X4:$i > $o]:(((X4 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4))|~((epred1_0 @ (esk4_2 @ (^[Z0/* 3 */:$i]:(($true))) @ X4))))), inference(cn,[status(thm)],[inference(er,[status(thm)],[c_0_13])])).
2.14/0.82	thf(c_0_16, negated_conjecture, ![X4:$i > $o]:(((epred1_0 @ (esk4_2 @ X4 @ (^[Z0/* 7 */:$i]:(~((epred1_0 @ Z0))))))|~((X4 @ esk1_0))|~((X4 @ esk3_0)))), inference(ef,[status(thm)],[c_0_14])).
2.14/0.82	thf(c_0_17, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16])])]), ['proof']).
2.14/0.82	# SZS output end CNFRefutation
2.14/0.82	# Parsed axioms                        : 1
2.14/0.82	# Removed by relevancy pruning/SinE    : 0
2.14/0.82	# Initial clauses                      : 16
2.14/0.82	# Removed in clause preprocessing      : 0
2.14/0.82	# Initial clauses in saturation        : 16
2.14/0.82	# Processed clauses                    : 1342
2.14/0.82	# ...of these trivial                  : 64
2.14/0.82	# ...subsumed                          : 489
2.14/0.82	# ...remaining for further processing  : 789
2.14/0.82	# Other redundant clauses eliminated   : 1823
2.14/0.82	# Clauses deleted for lack of memory   : 0
2.14/0.82	# Backward-subsumed                    : 113
2.14/0.82	# Backward-rewritten                   : 389
2.14/0.82	# Generated clauses                    : 6578
2.14/0.82	# ...of the previous two non-redundant : 4297
2.14/0.82	# ...aggressively subsumed             : 0
2.14/0.82	# Contextual simplify-reflections      : 25
2.14/0.82	# Paramodulations                      : 659
2.14/0.82	# Factorizations                       : 14
2.14/0.82	# NegExts                              : 118
2.14/0.82	# Equation resolutions                 : 1856
2.14/0.82	# Disequality decompositions           : 0
2.14/0.82	# Total rewrite steps                  : 430
2.14/0.82	# ...of those cached                   : 426
2.14/0.82	# Propositional unsat checks           : 0
2.14/0.82	#    Propositional check models        : 0
2.14/0.82	#    Propositional check unsatisfiable : 0
2.14/0.82	#    Propositional clauses             : 0
2.14/0.82	#    Propositional clauses after purity: 0
2.14/0.82	#    Propositional unsat core size     : 0
2.14/0.82	#    Propositional preprocessing time  : 0.000
2.14/0.82	#    Propositional encoding time       : 0.000
2.14/0.82	#    Propositional solver time         : 0.000
2.14/0.82	#    Success case prop preproc time    : 0.000
2.14/0.82	#    Success case prop encoding time   : 0.000
2.14/0.82	#    Success case prop solver time     : 0.000
2.14/0.82	# Current number of processed clauses  : 183
2.14/0.82	#    Positive orientable unit clauses  : 5
2.14/0.82	#    Positive unorientable unit clauses: 0
2.14/0.82	#    Negative unit clauses             : 1
2.14/0.82	#    Non-unit-clauses                  : 177
2.14/0.82	# Current number of unprocessed clauses: 2769
2.14/0.82	# ...number of literals in the above   : 17715
2.14/0.82	# Current number of archived formulas  : 0
2.14/0.82	# Current number of archived clauses   : 606
2.14/0.82	# Clause-clause subsumption calls (NU) : 40215
2.14/0.82	# Rec. Clause-clause subsumption calls : 2484
2.14/0.82	# Non-unit clause-clause subsumptions  : 622
2.14/0.82	# Unit Clause-clause subsumption calls : 179
2.14/0.82	# Rewrite failures with RHS unbound    : 0
2.14/0.82	# BW rewrite match attempts            : 12
2.14/0.82	# BW rewrite match successes           : 5
2.14/0.82	# Condensation attempts                : 0
2.14/0.82	# Condensation successes               : 0
2.14/0.82	# Termbank termtop insertions          : 365037
2.14/0.82	# Search garbage collected termcells   : 239
2.14/0.82	
2.14/0.82	# -------------------------------------------------
2.14/0.82	# User time                : 0.283 s
2.14/0.82	# System time              : 0.008 s
2.14/0.82	# Total time               : 0.291 s
2.14/0.82	# Maximum resident set size: 1772 pages
2.14/0.82	
2.14/0.82	# -------------------------------------------------
2.14/0.82	# User time                : 0.283 s
2.14/0.82	# System time              : 0.012 s
2.14/0.82	# Total time               : 0.295 s
2.14/0.82	# Maximum resident set size: 1692 pages
2.14/0.82	% E---3.1 exiting
2.14/0.82	% E exiting
2.14/0.82	EOF